Dispersion function computations for unlimited frequency values
نویسندگان
چکیده
منابع مشابه
Time Bounded Frequency Computations
This disproves a conjecture of Kinber. (2) We give a transparent proof of a generalization of Kinber's result that there exist arbitrarily complex problems admitting a polynomial time frequency computation. Several corollaries provide more insight into the structure of the hierarchy of polynomial time frequency classes. (3) The relationships between polynomial time frequency classes and selecti...
متن کاملRegular frequency computations
An (m,n)-computation of a function f is given by a deterministic Turing machine which on n pairwise different inputs produces n output values where at least m of the n values are in accordance with f . In such a case we say that the Turing machine computes f with frequency ≥ m/n. The most prominent result for frequency computations is due to Trakhtenbrot: The class of (m,n)-computable functions...
متن کاملContinuation Semantics Values, Contexts and Computations
A promising line of research in the interaction between syntax and semantics has been open by the work on Continuation Semantics started by [1] and [5] and further explored by [8]. Work done within Curry Howard Correspondence to Classical Logic has brought to the attention the duality distinction holding between terms and contexts (or co-terms), and can help further shaping the syntax-semantics...
متن کاملImplementing belief function computations
This papers discusses several implementation aspects for Dempster-Shafer belief functions. The main objective is to propose an appropriate representation of mass functions and efficient data structures and algorithms for the two basic operations of combination and marginalization.
متن کاملShared Computations for Eecient Interval Function Evaluation
In global optimization using interval analysis, functions, their gradients and other expressions are evaluated again and again { often after small changes in argument values. This suggests that intermediate results obtained earlier in the algorithm could be reused later in order to speed up computations. This paper develops such techniques and shows that substantial improvements in speed are in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geophysical Journal International
سال: 1979
ISSN: 0956-540X,1365-246X
DOI: 10.1111/j.1365-246x.1979.tb01011.x